منابع مشابه
A twisted factorization method for symmetric SVD of a complex symmetric tridiagonal matrix
This paper presents an O(n2) method based on the twisted factorization for computing the Takagi vectors of an n-by-n complex symmetric tridiagonal matrix with known singular values. Since the singular values can be obtained in O(n2) flops, the total cost of symmetric singular value decomposition or the Takagi factorization is O(n2) flops. An analysis shows the accuracy and orthogonality of Taka...
متن کاملNonnegative Matrix Factorization of a Correlation Matrix
We present a dedicated algorithm for the nonnegative factorization of a correlation matrix from an application in financial engineering. We look for a low-rank approximation. The origin of the problem is discussed in some detail. Next to the description of the algorithm, we prove, by means of a counter example, that an exact nonnegative decomposition of a general positive semidefinite matrix is...
متن کاملTensor Factorization via Matrix Factorization
Tensor factorization arises in many machinelearning applications, such knowledge basemodeling and parameter estimation in latentvariable models. However, numerical meth-ods for tensor factorization have not reachedthe level of maturity of matrix factorizationmethods. In this paper, we propose a newmethod for CP tensor factorization that usesrandom projections to ...
متن کاملA social recommender system based on matrix factorization considering dynamics of user preferences
With the expansion of social networks, the use of recommender systems in these networks has attracted considerable attention. Recommender systems have become an important tool for alleviating the information that overload problem of users by providing personalized recommendations to a user who might like based on past preferences or observed behavior about one or various items. In these systems...
متن کاملA Projected Alternating Least square Approach for Computation of Nonnegative Matrix Factorization
Nonnegative matrix factorization (NMF) is a common method in data mining that have been used in different applications as a dimension reduction, classification or clustering method. Methods in alternating least square (ALS) approach usually used to solve this non-convex minimization problem. At each step of ALS algorithms two convex least square problems should be solved, which causes high com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BIT Numerical Mathematics
سال: 2009
ISSN: 0006-3835,1572-9125
DOI: 10.1007/s10543-009-0217-0